A Realizability Interpretation for Classical Arithmetic
نویسندگان
چکیده
منابع مشابه
A Realizability Interpretation for Classical Arithmetic
A constructive realizablity interpretation for classical arithmetic is presented, enabling one to extract witnessing terms from proofs of 1 sentences. The interpretation is shown to coincide with modified realizability, under a novel translation of classical logic to intuitionistic logic, followed by the Friedman-Dragalin translation. On the other hand, a natural set of reductions for classical...
متن کاملOn Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
This article investigates Krivine’s realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a two-step interpretation which first eliminates classical logic via a negative translation and then applies standard realizability interpretation. We then argue that a slight variant of Krivine’s interpretation cor...
متن کاملA realizability interpretation for classical analysis
We present a realizability interpretation for classical analysis–an association of a term to every proof so that the terms assigned to existential formulas represent witnesses to the truth of that formula. For classical proofs of Π2 sentences ∀x∃yA(x, y), this provides a recursive type 1 function which computes the function given by f(x) = y iff y is the least number such that A(x, y).
متن کاملInteractive Realizability for Classical Peano Arithmetic with Skolem Axioms
Interactive realizability is a computational semantics of classical Arithmetic. It is based on interactive learning and was originally designed to interpret excluded middle and Skolem axioms for simple existential formulas. A realizer represents a proof/construction depending on some state, which is an approximation of some Skolem functions. The realizer interacts with the environment, which ma...
متن کاملQuantitative classical realizability
Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functions are interpreted as bounded time computable functions. It has been used to give new and uniform proofs of soundness of several type systems with respect to certain time complexity classes. We propose a reformulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2002
ISSN: 1079-8986
DOI: 10.2307/3062217